Coarse-grained discrete element method for granular shear flow
نویسندگان
چکیده
منابع مشابه
Granular element method for three-dimensional discrete element calculations
This paper endows the recently-proposed granular element method (GEM) with the ability to perform 3D discrete element calculations. By using non-uniform rational B-Splines to accurately represent complex grain geometries, we proposed an alternative approach to clustering-based and polyhedra-based discrete element methods whereby the need for complicated and ad hoc approaches to construct 3D gra...
متن کاملNumerical Improvement of the Discrete Element Method applied to Shear of Granular Media
We present a detailed analysis of the bounds on the integration step in Discrete Element Method (DEM) for simulating collisions and shearing of granular assemblies. We show that, in the numerical scheme, the upper limit for the integration step, usually taken from the average time tc of one contact, is in fact not sufficiently small to guarantee numerical convergence of the system during relaxa...
متن کاملA Study of the Wave Propagation Velocity in Granular Soils Using Discrete Element Method (DEM)
In the present paper, discrete element method (DEM) is used to study wave propagation phenomenon in granular soils. The effect of factors such as coefficient of friction, frequency, normal stiffness and soil gradation on the wave velocity is studied. Using the wall motion based on the sinusoidal function is the method of loading used in this simulation, through which the pressure wave is transf...
متن کاملCoarse Grained Parallel Next Element Search
We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/ p) log n) local computation, and O((n/p) log n) storage per processor. Our result implies solutions to the point location, trapezoid...
متن کاملCoarse Grained Parallel Next Element Search
We present a parallel algorithm for solving the next element search problem on a set of line segments, using a BSP like model referred to as the Coarse Grained Multicomputer (CGM). The algorithm requires O(1) communication rounds (h-relations with h=O(n/p)), O((n/ p) log n) local computation, and O((n/p) log n) storage per processor. Our result implies solutions to the point location, trapezoid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chemical Engineering Journal Advances
سال: 2020
ISSN: 2666-8211
DOI: 10.1016/j.ceja.2020.100050